Wadge Hierarchy of differences of Co-analytic Sets

نویسنده

  • Kevin Fournier
چکیده

We begin the fine analysis of non Borel pointclasses. Working in ZFC + ̃ 11), we describe the Wadge hierarchy of the class of increasing differences of coanalytic subsets of the Baire space by extending results obtained by Louveau ([5]) for the Borel sets. Introduction. Collections of substets of the Baire space, the "logician’s reals", that are closed under continuous preimages have always been ubiquitous in descriptive set theory. It is thus quite remarkable to realize that the concept of pointclass has not been singled out and studied for itself before the 1960’s and the work of Wadge. In his PhD Thesis ([10]), he was the first to study systematically the concept, via the notion of continuous reducibility. Given two subsets A and B of the Baire space, A is said to be reducible to B, and we write A ≤W B, if and only if A is the preimage of B for some continuous function f from the Baire space to itself. The relation ≤W is merely by definition a preorder, and its initial segments are exactly the pointclasses of the Baire space. When restricted to a class with suitable closure properties, the preorder induced by ≤W on its equivalence classes, the Wadge degrees, is in fact a well-quasi-ordering. The study of this well-quasi-ordering, the Wadge hierarchy, and of the Wadge degreees gives thus the finest analysis of the pointclasses of the Baire space. The Wadge hierarchy of the Borel subsets of the Baire space has been thoroughly studied by Louveau in [5] and Duparc in [3] and [2], in two different manners that were both initiated by Wadge. The former relies on a Theorem proved by Wadge stating that all the non self-dual Borel pointclasses can be obtained by ω-ary Borel boolean operations on open sets a result later generalized to all non self-dual pointclasses of the Baire space by Van Wesep in [8] under AD, using of course arbitrary ω-ary boolean operations. Louveau’s work provides a description of all the Borel pointclasses, and thus of the whole Wadge hierarchy on the Borel sets, by means of boolean operations. The latter approach, followed by Duparc and that we do not pursue here, aims to define and use specific operations on sets in order to give for each Wadge class of Borel subsets a canonical complete set. This research was partially supported by the Swiss National Science Fundation grant number 200021− 135401. c © 0000, Association for Symbolic Logic 0022-4812/00/0000-0000/$00.00

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ω-powers and Descriptive Set Theory

We study the sets of the infinite sentences constructible with a dictionary over a finite alphabet, from the viewpoint of descriptive set theory. Among other things, this gives some true co-analytic sets. The case where the dictionary is finite is studied and gives a natural example of a set at the level ω of the Wadge hierarchy.

متن کامل

Fixpoint alternation and the Wadge hierarchy

In [2] Bradfield found a link between finite differences formed by Σ2 sets and the mu-arithmetic introduced by Lubarski [10]. We extend this approach into the transfinite: in allowing countable disjunctions we show that this kind of extended mu-calculus matches neatly to the transfinite difference hierarchy of Σ2 sets. The difference hierarchy is intimately related to parity games. When passing...

متن کامل

Wadge Hardness in Scott Spaces and Its Effectivization

We prove some results on the Wadge order on the space of sets of natural numbers endowed with Scott topology, and more generally, on omega-continuous domains. Using alternating decreasing chains we characterize the property of Wadge hardness for the classes of the Hausdorff difference hierarchy (iterated differences of open sets). A similar characterization holds for Wadge one-to-one and finite...

متن کامل

Transfinite Extension of the Mu-Calculus

In [2] Bradfield found a link between finite differences formed by Σ2 sets and the mu-arithmetic introduced by Lubarski [10]. We extend this approach into the transfinite: in allowing countable disjunctions we show that this kind of extended mu-calculus matches neatly to the transfinite difference hierarchy of Σ2 sets. The difference hierarchy is intimately related to parity games. When passing...

متن کامل

The Topological Complexity of Models of the μ-Calculus On The Alternation Free Fragment and Beyond

Recently Murlak and one of the authors have shown that the family of trees recognized by weak alternating automata (or equivalently, the family of tree models of the alternation free fragment of the modal μcalculus) is closed under three set theoretic operations that corresponds to sum, multiplication by ordinals < ωω and pseudo exponentiation with the base ω1 of the Wadge degree. Moreover they...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Symb. Log.

دوره 81  شماره 

صفحات  -

تاریخ انتشار 2016